complexity of computation造句
例句與造句
- Increasing the fft ’ s points can decrease the frequency interval , but it will increase the complexity of computation at large extent
如采用增大fft運(yùn)算的點(diǎn)數(shù)來(lái)減小頻率采樣的間隔,將大大增加數(shù)字信號(hào)處理的運(yùn)算量,從而影響到雷達(dá)工作的實(shí)時(shí)性。 - Numerical results are compared with that of the analytical solution , it was shown that the complexity of computation was reduced drastically without sacrificing much accuracy
數(shù)值結(jié)果表明：標(biāo)準(zhǔn)拋物線方程算法在計(jì)算目標(biāo)雷達(dá)散射截面時(shí)具有較高精度，且計(jì)算速度大大提高。 - The analysis is also given on the sphere of application , the complexity of computation . after the extraction of the precise tdoa signal , it is the major problem
在提取到準(zhǔn)確的時(shí)差信號(hào)后,論文第四部分就如何獲取精確的目標(biāo)輻射源位置,即定位算法進(jìn)行了研究,主要分析了非線性定位方程組的求解技術(shù) - The experiments confirm this method is suitable for many kinds of images , its complexity of computation is less than traditional pixel - based methods , and also it can help do with the oversegmentation
實(shí)驗(yàn)表明，該方法可以適合于多種類型的圖像并且其計(jì)算量遠(yuǎn)小于傳統(tǒng)的基于像素的區(qū)域生長(zhǎng)方法，同時(shí)有助于改善由圖像噪聲所引起的過(guò)分割現(xiàn)象。 - In term of the orthogonal property of alamouti scheme and the character of the ofdm system equivalent model expression of receiver signal for stbc - ofdm system was obtained by flexible transform method so that the inverse of matrix was avoided using direct - decision mode and the complexity of computation and receiver was decreased . the simulation results show the validity and efficiency of the proposed receiver . ( 6 ) an adaptive equalization algorithm used in space - time block coded ofdm ( stbc - ofdm ) system with alamou
該算法充分利用了alamouti編碼的正交特性和多發(fā)射天線ofdm系統(tǒng)特點(diǎn)，通過(guò)靈活的變換對(duì)接收信號(hào)進(jìn)行等價(jià)的表示；通過(guò)對(duì)11矩陣求逆的研究，將塊最小二乘遞推算法（ brl ）中的zkxzk的矩陣求逆分解為k個(gè)2x2矩陣的求逆，從而降低了自適應(yīng)算法的運(yùn)算量和接收機(jī)的復(fù)雜度。 - It's difficult to find complexity of computation in a sentence. 用complexity of computation造句挺難的
- 3 the concept of equivalence matrix , which expresses equivalence relation in rough set information system , is introduced ; the relations between equivalence matrix and equivalence classes are discussed . the algorithms for data cleaning and rules extraction in knowledge system based on matrix computation are proposed and their complexity of computation is analyzed
3 、在等價(jià)矩陣概念的基礎(chǔ)上，分析了粗糙集知識(shí)系統(tǒng)中等價(jià)劃分與等價(jià)摘要矩陣的關(guān)系，采用等價(jià)矩陣來(lái)表示粗糙集的等價(jià)關(guān)系，提出了一種對(duì)數(shù)據(jù)庫(kù)知識(shí)系統(tǒng)進(jìn)行數(shù)據(jù)清洗以及從中提取決策規(guī)則的矩陣算法，分析了該算法的計(jì)算復(fù)雜性。 - After deeply investigate and analysis , we found the drawback of clique lies in its inconsideration of the characteristic of the data being processed . it grid the data into a predefined grid and this adds up to the complexity of the computation . then it has to degrade the accuracy of the result to degrade the complexity of computation ,
通過(guò)深入的研究和分析，發(fā)現(xiàn)由于clique算法沒(méi)有考慮到如何利用當(dāng)前挖掘數(shù)據(jù)的特性，而是進(jìn)行一種硬性的網(wǎng)格劃分，因此增加了計(jì)算復(fù)雜程度，而為了降低計(jì)算的復(fù)雜程度就只能降低聚類結(jié)果的精確性。 - Based on the introduction of the principles of takagi - sugeno ( t - s ) fuzzy model and generalized predictive control ( gpc ) algorithm , the fuzzy predictive control method combining gpc and t - s model is classified as three kinds of algorithms . the design method of these algorithms is presented in detail . a comparison of these fgpc strategies in control performance and complexity of computation is given by simulation
在介紹了t - s模糊模型和gpc基本原理的基礎(chǔ)上，將基于t - s模型的gpc歸納為三種算法，從理論上對(duì)這三種算法進(jìn)行了詳細(xì)地推導(dǎo)，并通過(guò)仿真研究比較了三種算法的控制性能和計(jì)算負(fù)擔(dān)上的差異；從而為這一類模糊預(yù)測(cè)控制的實(shí)際應(yīng)用提供了選擇的依據(jù)，也為進(jìn)一步的性能分析奠定了基礎(chǔ)。